CBack: A Simple Tool for Backtrack Programming in C

نویسنده

  • Keld Helsgaun
چکیده

Backtrack programming is such a powerful technique for problem solving that a number of languages, especially in the area of artificial intelligence, have built-in facilities for backtrack programming. This paper describes CBack, a simple, but general tool for backtrack programming in the programming language C. The use of the tool is illustrated through examples of a tutorial nature. In addition to the usual depth-first search strategy, CBack provides for the more general heuristic best-first search strategy. The implementation of CBack is described in detail. The source code, shown in its full length, is entirely written in ANSI C and highly portable across diverse computer architectures and C compilers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Restarted Search

We consider the problem of parallelizing restarted backtrack search. With few notable exceptions, most commercial and academic constraint programming solvers do not learn no-goods during search. Depending on the branching heuristics used, this means that there are little to no side-effects between restarts, making them an excellent target for parallelization. We develop a simple technique for p...

متن کامل

Modified FGP approach and MATLAB program for solving multi-level linear fractional programming problems

In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...

متن کامل

CPE/CSC 480-F05 Artificial Intelligence

Invoke the Constraint Satisfaction applet, and load the sample "Five Queens Problem". Look at the graph displayed, and determine the relationship between the conventional representation of the queens problem on a chess board, and this one. Then use the tool to solve the problem. You can do this either in "Auto-Solve" mode, or manually: Select values for a variable, and then let the tool calcula...

متن کامل

The Strategies to Improve Performance of Function Mining By Gene Expression Programming -Genetic Modifying, Overlapped Gene, Backtracking and Adaptive Mutation

This paper introduces the technologies to improve the performance of function mining by Gene Expression Programming (GEP) developed in Sichuan University last year. The main results include: (a) Genetic Modifying Algorithm (Trans-gene). By injection gene segment into genome, it guides the evolutional direction and speeds up knowledge discovery process. (b) Overlapped gene expression. Borrowing ...

متن کامل

CLab: A C++ Library for Fast Backtrack-Free Interactive Product Configuration

Product configuration is a successful application area of constraint programming. CLab [1, 2] is an open source C++ library for building fast backtrack-free interactive product configurators. It contains functions that support a two-phase approach to interactive product configuration described by Hadzic et al. [3]. In the first phase, a Binary Decision Diagram (BDD) representing the set of vali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Softw., Pract. Exper.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1995